Penerapan Konsep Finite State Automata Pada Proses Pengajuan Antivirus Di Lingkungan Provinsi Dki Jakarta
نویسندگان
چکیده
Dinas Komunikasi, Informatika dan Statistik Provinsi DKI Jakarta khususnya Bidang Siber Sandi mempunyai tugas menyelenggarakan layanan serta keamanan informasi, diantaranya pengajuan antivirus bagi Satuan Kerja Perangkat Daerah/Unit Daerah (SKPD/UKPD) di lingkungan Pemerintah Jakarta. Proses secara manual masih membutuhkan waktu yang lama seringan kali membuat dokumen/surat permohonan beredar melalui salah satu aplikasi messenger seperti whatsapp dimana hal ini tidak sesuai dengan prinsip informasi yaitu kerahasiaan (confidentiality), integritas (integrity) kesediaan (availability). Penelitian bertujuan untuk menggunakan konsep Finite State Automata (FSA) pada saat proses validasi data diinput form pengajuan. Dengan diterapkannya penelitian diharapkan dapat membantu Sandi, dalam melayani perangkat daerah mempercepat antivirus, meminimalisir terjadinya kehilangan menjaga standar informasi.
منابع مشابه
Implementasi Sistem Pengelolaan Proses Bisnis Mengacu Pada Mit Process Handbook
MIT Process Handbook offers a method of storage and retrieval of an organization's business processes. Business community or college students who take the topic of business processes can learn best-practice business processes contained in the MIT Process Handbook. Collection of business processes that are contained in the MIT Process Handbook only manage the business process description in text...
متن کاملPenerapan teknik web scraping pada mesin pencari artikel ilmiah
Search engines are a combination of hardware and computer software supplied by a particular company through the website which has been determined. Search engines collect information from the web through bots or web crawlers that crawls the web periodically. The process of retrieval of information from existing websites is called "web scraping." Web scraping is a technique of extracting informat...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملEfektifitas Teknologi Informasi Dalam Proses Belajar Mengajar Pada Universitas Budi Luhur
In general, however, IT will empower students to have greater control over the learning process, with all the benefits associated with active learning and personal responsibility. Not only will students decide when to learn and how to learn, increasingly they will also decide what to learn and how that learning is to be certified. Traditionally, higher education institutions have combined sever...
متن کاملRepresentation of Finite State Automata
In this paper, we propose some techniques for injecting nite state automata into Recurrent Radial Basis Function networks (R 2 BF). When providing proper hints and constraining the weight space properly, we show that these networks behave as automata. A technique is suggested for forcing the learning process to develop automata representations that is based on adding a proper penalty function t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Ilmiah Ilmu Komputer Fakultas Ilmu Komputer Universitas Al Asyariah Mandar
سال: 2022
ISSN: ['2442-451X', '2503-3832']
DOI: https://doi.org/10.35329/jiik.v8i2.220